A parallel root-finding algorithm
نویسندگان
چکیده
منابع مشابه
A new root-based direction-finding algorithm
[1] Polynomial rooting direction-finding (DF) algorithms are a computationally efficient alternative to search-based DF algorithms and are particularly suitable for uniform linear arrays of physically identical elements provided that mutual interaction among the array elements can be either neglected or compensated for. A popular algorithm in such situations is Root Multiple Signal Classificati...
متن کاملA parallel algorithm for finding congruent regions
In this paper, we study the problem for finding all the regions, which are congruent to a testing region R, in an input planar figure F. In a shared memory system with m processors, we propose an el~cient MAX { O(mn), O(n log n)} time parallel algorithm, where n, m are the numbers of edges of F and R, respectively. Furthermore, our algorithm does not require to read from or write into the same ...
متن کاملMcmullen’s Root-finding Algorithm for Cubic Polynomials
We show that a generally convergent root-finding algorithm for cubic polynomials defined by C. McMullen is of order 3, and we give generally convergent algorithms of order 5 and higher for cubic polynomials. We study the Julia sets for these algorithms and give a universal rational map and Julia set to explain the dynamics.
متن کاملParallel Root-Finding Method for LPC Analysis of Speech
This paper describes a selective root finding method for polynomials based in Complex Analysis results. It can find the poles of the speech signal LPC model that are close to the unit circle, without wasting computations with the others, lesser significant ones. This feature makes our method faster than the standard ones for speech analysis. These poles are in better correspondence with the for...
متن کاملApplying Parallel Programming to Path-Finding With the A* Algorithm
The A* algorithm is a popular choice for game developers when implementing artificial intelligence for pathfinding purposes. These calculations are typically carried out on a single thread and are often modified for efficiency at the cost of admissibility. Parallel computing can be leveraged to provide both speed and accuracy while scaling to support the trend of increasingly numerous entities ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2015
ISSN: 1461-1570
DOI: 10.1112/s1461157015000236